and is set by a call to ddddmmmmFFFFSSSS1111000011116666EEEEnnnnccccooooddddeeeerrrrSSSSeeeettttPPPPaaaarrrraaaammmmssss((((3333ddddmmmm)))). Without calling
ddddmmmmFFFFSSSS1111000011116666EEEEnnnnccccooooddddeeeerrrrSSSSeeeettttPPPPaaaarrrraaaammmmssss((((3333ddddmmmm)))), encoder sets default to 4800 bits/s.
ddddmmmmFFFFSSSS1111000011116666EEEEnnnnccccooooddddeeee((((3333ddddmmmm)))) algorithm uses linear prediction analysis operations
that simply delays the output by half of the analysis frame size.
Therefore the delays are 120, 80, or 60 samples for operations of 4800,
7200, or 9600 bit/s respectively. In file conversion expecting N samples
in and out, the output signal is offset by 120, 80, or 60 samples from
the first sample. The application may want to discard the first 120, 80,
or 60 samples returned in output date buffer from ddddmmmmFFFFSSSS1111000011116666DDDDeeeeccccooooddddeeee.
FS1016 compression uses a linear prediction scheme. This means that the
compressed bits, which carrying compressed information, are interrelated
or interdependent. If a application calls aaaaffffSSSSeeeeeeeekkkkFFFFrrrraaaammmmeeee(((()))) to an offset
into the compressed bit stream file and then starts reading bits in the
middle of the bit stream and decompress them with ddddmmmmFFFFSSSS1111000011116666DDDDeeeeccccooooddddeeee((((3333ddddmmmm)))),
the interdependency of the bits at the cutting point is lost. The
application will initially get back data with a lower amplitude than if
he had read the same data back during a complete pass over the file from
the beginning.
There is no way to exactly recreate the decoded data in the middle of the
bit stream file without going all the way back to the beginning.
However, with a "preroll" value to read ahead a portion of the compressed
file, application can compensate for the amplitude problem. We recommend
2 second "preroll".
NNNNOOOOTTTTEEEE
FS1016 algorithm was developed for sampling rate of 8 kHz.